New Features of the SAT’04 versions of zChaff
نویسندگان
چکیده
Zchaff is an implementation of the well known Chaff algorithm [6]. It participated in the SAT 2002 Competition and won the Best Complete Solver in both industrial and handmade benchmark categories. It is a popular solver and can be compiled into a linkable library for easy integration with user applications. Successful integration examples include the BlackBox AI planner [1], NuSMV model checker [2], GrAnDe theorem prover [3], and others.
منابع مشابه
zChaff: Modifications and Extensions
The application of SAT solver in industrial verificationtools is mandatory for the successful analysis of prob-lems derived from hardware design, e.g. CombinationalEquivalence Checking (CEC) and Bounded Model Check-ing (BMC). In [8] Chaff, a new powerful SAT solver, waspresented that outperforms most of the existing publiclyavailable SAT solvers when applied to hard ...
متن کاملFifty-Five Solvers in Vancouver: The SAT 2004 Competition
For the third consecutive year, a SAT competition was organized as a joint event with the SAT conference. With 55 solvers from 25 author groups, the competition was a clear success. One of the noticeable facts from the 2004 competition is the superiority of incomplete solvers on satisfiable random k-SAT benchmarks. It can also be pointed out that the complete solvers awarded this year, namely Z...
متن کاملTuning the VSIDS Decision Heuristic for Bounded Model Checking
Bounded Model Checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (Generic search Algorithm for Satisfiability Problem) and more recently zchaff. In order to cope with very large hardware designs, our work exploited the unique characteristics of bounded model checking to enhance the SAT algorithms used to solve our problems. In our wor...
متن کاملCertification of SAT Solvers in Coq
We describe here a fully portable, open source certifier for traces of SAT problems produced by zChaff [6]. It can also be easily adapted for MiniSat [4], PicoSat [2] and Booleforce, which we have done for PicoSat. Our certifier has been developped with the proof assistant Coq. We give some figures based on the pigeon hole, comparing both PicoSat and zChaff on the one hand, and our certifier wi...
متن کاملUsing Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewarding the variables participating in conflicts during the search process. In this paper we propose to extend the simple rewarding mechanism used in zChaff and BerkMin, and develop different rewarding mechanisms based on...
متن کامل